#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int MAXN = 1e5+9;

int a[MAXN],n,cnt = 0;
int dp[MAXN];




int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);

    memset(a,sizeof(a),0);
    memset(dp,sizeof(dp),0);

    cin >> n;

    for (int i = 1; i<= n ;i++){
        cin >> a[i];
    }
    sort(a+1,a+n+1);

    for (int i = 1;i<= n;i++){
        for(int j = 1;j<= n;j++){
            if (a[i] > dp[j]){
                dp[j] = a[i];
                break;
            }
        }
    }

    for (int i = 1; i<= n; i++){
        if (dp[i]){
            cnt++;
        }
    }


    cout << cnt << endl;
    
    
    return 0;
}